Two-Path Convexity and Bipartite Tournaments of Small Rank
نویسندگان
چکیده
We study two-path convexity in bipartite tournaments. For a bipartite tournament, we obtain both a necessary condition and a sufficient condition on the adjacency matrix for its rank to be two. We then investigate 4-cycles in bipartite tournaments of small rank. We show that every vertex in a bipartite tournament of rank two lies on a four cycle, and bipartite tournaments with a maximum number of 4-cycles do not necessarily have minimum rank.
منابع مشابه
Two-path convexity in clone-free regular multipartite tournaments
We present some results on two-path convexity in clone-free regular multipartite tournaments. After proving a structural result for regular multipartite tournaments with convexly independent sets of a given size, we determine tight upper bounds for their size (called the rank) in clone-free regular bipartite and tripartite tournaments. We use this to determine tight upper bounds for the Helly a...
متن کاملOn two-path convexity in multipartite tournaments
In the context of two-path convexity, we study the rank, Helly number, Radon number, Caratheodory number, and hull number for multipartite tournaments. We show the maximum Caratheodory number of a multipartite tournament is 3. We then derive tight upper bounds for rank in both general multipartite tournaments and clone-free multipartite tournaments. We show that these same tight upper bounds ho...
متن کاملConvex independence and the structure of clone-free multipartite tournaments
We investigate the convex invariants associated with two-path convexity in clonefree multipartite tournaments. Specifically, we explore the relationship between the Helly number, Radon number and rank of such digraphs. The main result is a structural theorem that describes the arc relationships among certain vertices associated with vertices of a given convexly independent set. We use this to p...
متن کاملConvex invariants in multipartite tournaments
In the study of convexity spaces, the most common convex invariants are based on notions of independence with respect to taking convex hulls. In [D.B. Parker, R.F. Westhoff and M.J. Wolf, Discuss. Math. Graph Theory 29 (2009), 51–69], H-independence, R-independence and convex independence were studied to prove results about the Helly number, Radon number and rank of a clone-free multipartite to...
متن کاملOn the balanced case of the Brualdi-Shen conjecture on 4-cycle decompositions of Eulerian bipartite tournaments
The Brualdi-Shen Conjecture on Eulerian Bipartite Tournaments states that any such graph can be decomposed into oriented 4-cycles. In this article we prove the balanced case of the mentioned conjecture. We show that for any 2n×2n bipartite graph G = (U ∪V,E) in which each vertex has n-neighbors with biadjacency matrixM (or its transpose), there is a particular proper edge coloring of a column p...
متن کامل